Multiplicative Updating Rule for Blind Separation Derived from the Method of Scoring
نویسنده
چکیده
For blind source separation, when the Fisher information matrix is used as the Riemannian metric tensor for the parameter space, the steepest descent algorithm to maximize the likelihood function in this Riemannian parameter space becomes the serial updating rule with equivariant property. This algorithm can be further simplified by using the asymptotic form of the Fisher information matrix around the equilibrium.
منابع مشابه
Blind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملBlind Separation of Jointly Stationary Correlated Sources
The separation of unobserved sources from mixed observed data is a fundamental signal processing problem. Most of the proposed techniques for solving this problem rely on independence or at least uncorrelation assumption for source signals. This paper introduces a technique for cases that source signals are correlated with each other. The method uses Wold decomposition principle for extracting ...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملBlind Separation for Convolutive Mixtures of Non-stationary Signals
This paper proposes a method of "blind separation" which extracts non-stationary signals (e.g., speech signals, music) from their convolutive mixtures. The function is acquired by modifying a network's parameters so that a cost function takes the minimum at any time. The cost function is the one introduced by Matsuoka et al. [15]. The learning rule is derived from the natural gradient [1] minim...
متن کامل